Estimating Search Tree Size
نویسندگان
چکیده
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the unexplored part of the search tree will be similar to the part we have so far explored. We compare these methods against an old method due to Knuth based on random probing. We show that these methods can reliably estimate the size of search trees explored by both optimization and decision procedures. We also demonstrate that these methods for estimating search tree size can be used to select the algorithm likely to perform best on a particular problem instance.
منابع مشابه
Estimating the size of search trees by sampling with domain knowledge
We show how recently-defined abstract models of the Branch & Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from Mi...
متن کاملEstimating Height and Diameter Growth of Some Street Trees in Urban Green Spaces
Estimating urban trees growth, especially tree height is very important in urban landscape management. The aim of the study was to predict of tree height base on tree diameter. To achieve this goal, 921 trees from five species were measured in five areas of Mashhad city in 2014. The evaluated trees were ash tree (Fraxinus species), plane tree (Platanus hybrida), white mulberry (Morus alba), ail...
متن کاملThe Coast of Searching in General Trees versus Complete Binary Trees
We consider the problem of searching in natural families of trees. A search in a tree T is a sequence of queries used to locate a pre-designated node called the \buggy" node. A query is made to any subtree in T. If the queried subtree contains the buggy node, then we restrict the search to that subtree, otherwise the search is restricted to the complement of that subtree in T. Two problems are ...
متن کاملOnline Search Cost Estimation for SAT Solvers
We present two different methods for estimating the cost of solving SAT problems. The methods focus on the online behaviour of the backtracking solver, as well as the structure of the problem. Modern SAT solvers present several challenges to estimate search cost including coping with nonchronological backtracking, learning and restarts. Our first method adapt an existing algorithm for estimatin...
متن کاملEstimating Search Tree Size with Duplicate Detection
In this paper we introduce Stratified Sampling with Duplicate Detection (SSDD), an algorithm for estimating the number of state expansions performed by heuristic search algorithms seeking solutions in state spaces represented by undirected graphs. SSDD is general and can be applied to estimate other state-space properties. We test SSDD on two tasks: (i) prediction of the number of A* expansions...
متن کامل